Families of ternary (t,m, s)-nets related to BCH-codes
نویسندگان
چکیده
A link between the theory of error-correcting codes and (t, m, s)nets leads to the efficient construction of two families of very good ternary nets. These have parameters (4r − 4, 4r, (32r + 1)/2 (for all r ≥ 2) and (2r− 4, 2r, (3r − 1)/2) (for all odd r ≥ 3). The underlying codes are cyclic codes.
منابع مشابه
Construction of digital nets from BCH-codes
We establish a link between the theory of error-correcting codes and the theory of (t, m, s)-nets. This leads to the fundamental problem of net embeddings of linear codes. Our main result is the construction of four infinite families of digital (t, m, s)-nets based on BCH-codes.
متن کاملFamilies of nets of low and medium strength
The theory of primitive BCH-codes is used to construct linear tms-nets. The codes provide explicit descriptions of ordered orthogonal arrays of low depth. In most cases a Gilbert-Varshamov theorem guarantees the existence of the net. In certain favorable circumstances we obtain explicit descriptions of the nets.
متن کاملA family of ternary quasi-perfect BCH codes
In this paper we present a family of ternary quasi-perfect BCH codes. These codes are of minimum distance 5 and covering radius 3. The first member of this family is the ternary quadratic-residue code of length 13.
متن کاملNew Codes via the Lengthening of Bch Codes with Uep Codes
We describe a code lengthening technique that uses Unequal Error Protection codes as suux codes and combine it with iteration of the conventional Construction X. By applying this technique to BCH codes, we obtain 5 new binary codes, 13 new ternary codes and 13 new quaternary codes. An improvement of Construction XX yields 2 new ternary codes.
متن کاملNarrow-Sense BCH Codes over $\gf(q)$ with Length $n=\frac{q^m-1}{q-1}$
Cyclic codes over finite fields are widely employed in communication systems, storage devices and consumer electronics, as they have efficient encoding and decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in most cases among the best cyclic codes. A subclass of good BCH codes are the narrow-sense BCH codes over GF(q) with length n = (qm−1)/(q−1). Little is known about ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002